Nearest Linear Manifold Classification

نویسندگان

  • Yuhui Yao
  • Lihui Chen
  • Yan Qiu Chen
چکیده

A novel classifier, named Nearest Linear Manifold uses a small number of prototypes to represent a class and extend their resentational capacity by using the linear manifold of the prototypes to provide more sufficient feature information for classification.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parametric Local Metric Learning for Nearest Neighbor Classification

We study the problem of learning local metrics for nearest neighbor classification. Most previous works on local metric learning learn a number of local unrelated metrics. While this ”independence” approach delivers an increased flexibility its downside is the considerable risk of overfitting. We present a new parametric local metric learning method in which we learn a smooth metric matrix func...

متن کامل

Equivariant Hopf bifurcation in a ring of identical cells with delayed coupling

We consider a ring of identical elements with time delayed, nearest-neighbour coupling. The individual elements are modelled by a scalar delay differential equation which includes linear decay and nonlinear delayed feedback. The bifurcation and stability of nontrivial asynchronous oscillations from the trivial solution are analysed using equivariant bifurcation theory and centre manifold constr...

متن کامل

Manifold Based Local Classifiers: Linear and Nonlinear Approaches

In case of insufficient data samples in highdimensional classification problems, sparse scatters of samples tend to have many ‘holes’—regions that have few or no nearby training samples from the class. When such regions lie close to inter-class boundaries, the nearest neighbors of a query may lie in the wrong class, thus leading to errors in the Nearest Neighbor classification rule. The K-local...

متن کامل

An intelligent fault diagnosis method of rolling bearings based on regularized kernel Marginal Fisher analysis

Generally, the vibration signals of fault bearings are non-stationary and highly nonlinear under complicated operating conditions. Thus, it’s a big challenge to extract optimal features for improving classification and simultaneously decreasing feature dimension. Kernel Marginal Fisher analysis (KMFA) is a novel supervised manifold learning algorithm for feature extraction and dimensionality re...

متن کامل

A Dimension Reduction Framework for HSI Classification Using Fuzzy and Kernel NFLE Transformation

In this paper, a general nearest feature line (NFL) embedding (NFLE) transformation called fuzzy-kernel NFLE (FKNFLE) is proposed for hyperspectral image (HSI) classification in which kernelization and fuzzification are simultaneously considered. Though NFLE has successfully demonstrated its discriminative capability, the non-linear manifold structure cannot be structured more efficiently by li...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001